THE BASIS NUMBER OF A GRAPHSCHMEICHEL EF.1981; J. COMP. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 2; PP. 123-129; BIBL. 2 REF.Article

A NOTE ON THE EDGE RECONSTRUCTION CONJECTURE.SCHMEICHEL EF.1975; BULL. AUSTRAL. MATH. SOC.; AUSTRAL.; DA. 1975; VOL. 12; NO 1; PP. 27-30; BIBL. 6 REF.Article

BOUNDS ON THE NUMBER OF CYCLES OF LENGTH THREE IN A PLANAR GRAPHHAKIMI SL; SCHMEICHEL EF.1982; ISR. J. MATH.; ISSN 0021-2172; ISR; DA. 1982; VOL. 41; NO 1-2; PP. 161-180; BIBL. 7 REF.Article

ON THE NUMBER OF CYCLES OF LENGTH K IN A MAXIMAL PLANAR GRAPHHAKIMI SL; SCHMEICHEL EF.1979; J. GRAPH THEORY; USA; DA. 1979; VOL. 3; NO 1; PP. 69-86; BIBL. 8 REF.Article

PANCYCLIC GRAPHS AND A CONJECTURE OF BONDY AND CHVATAL.SCHMEICHEL EF; HAKIMI SL.1974; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1974; VOL. 17; NO 1; PP. 22-34; BIBL. 11 REF.Article

ON P-CENTERS IN NETWORKSHAKIMI SL; SCHMEICHEL EF.1978; TRANSPORT. SCI.; USA; DA. 1978; VOL. 12; NO 1; PP. 1-15; BIBL. 10 REF.Article

ON THE NUMBER OF HAMILTONIAN CYCLES IN A MAXIMAL PLANAR GRAPHHAKIMI SL; SCHMEICHEL EF; THOMASSEN C et al.1979; J. GRAPH THEORY; USA; DA. 1979; VOL. 3; NO 4; PP. 365-370; BIBL. 4 REF.Article